On pseudoisomorphy and distributivity of quasigroups
نویسندگان
چکیده
A repeated bijection in an isotopism of quasigroups is called a companion of the third component. The last is called a pseudoisomorphism with the companion. Isotopy coincides with pseudoisomorphy∗ in the class of inverse property loops and with isomorphy in the class of commutative inverse property loops. This result is a generalization of the corresponding theorem for commutative Moufang loops. A notion of middle distributivity is introduced: a quasigroup is middle distributive if all its middle translations are automorphisms. In every quasigroup two identities of distributivity (left, right and middle) imply the third. This fact and some others help us to find a short proof of a theorem which gives necessary and sufficient conditions for a quasigroup to be distributive. There is but a slight difference between this theorem and the well-known Belousov’s theorem. Mathematics subject classification: 20N05.
منابع مشابه
The left (right) distributivity of semi-t-operators over 2-uninorms
Recently the distributive equations involving various classes of aggregation operators have aroused widespread attention because of their importance in the theoretic and applied communities of fuzzy set theory. 2-uninorms and semi-t-operators are two special classes of aggregation operators and have been proved to be useful in many areas such as fuzzy decision making, approximate reasoning and ...
متن کاملA New Cryptographic Property Based on the Orthogonality of Quasigroups
In order to achieve better cryptographic properties of quasigroups of order 4, we make a new classification. In our research we use an approach with generalized quasigroup orthogonality, which leads us to this interesting classification, on reducible and irreducible quasigroups. Existence of the classes of reducible and irreducible quasigroups depends on the property of orthogonality of quasigr...
متن کاملRecursively r-di erentiable quasigroups within S-systems and MDS-codes
We study recursively r-di erentiable binary quasigroups and such quasigroups with an additional property (strongly recursively r-di erentiable quasigroups). These quasigroups we nd in S-systems of quasigroups and give a lower bound of the parameters of idempotent 2-recursive MDS-codes that respect to strongly recursively r-di erentiable quasigroups. Some illustrative examples are given.
متن کاملVarieties of P-quasigroups
Decompositions of complete undirected graphs into sets of closed trails which partition the edge set of the graph and which contain each pair of distinct vertices exactly once at distance 2 define and are defined by a class of quasigroups called P-quasigroups. Conditions are established under which P-quasigroups are (or are not) homomorphic images of P-quasigroups which possess certain properti...
متن کاملEvolving Quasigroups by Genetic Algorithms
Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, it makes it an interesting tool for the application in computer security and for production of pseudorandom sequences. Most implementations of quasigroups are based on look-up table of the quasigroup, on system of distinct repre...
متن کامل